Informational Robustness and Solution Concepts∗
نویسندگان
چکیده
We discuss four solution concepts for games with incomplete information. We show how each solution concept can be viewed as encoding informational robustness. For a given type space, we consider expansions of the type space that provide players with additional signals. We distinguish between expansions along two dimensions. First, the signals can either convey payoff relevant information or only payoff irrelevant information. Second, the signals can be generated from a common (prior) distribution or not. We establish the equivalence between Bayes Nash equilibrium behavior under the resulting expansion of the type space and a corresponding more permissive solution concept under the original type space. This approach unifies some existing literature and, in the case of an expansion without a common prior and allowing for payoff relevant signals, leads us to a new solution concept that we dub belief-free rationalizability. Jel Classification: C79, D82.
منابع مشابه
Implementing Cooperative Solution Concepts: a Generalized Bidding Approach
This paper provides a framework for implementing and comparing several solution concepts for transferable utility cooperative games. We construct bidding mechanisms where players bid for the role of the proposer. The mechanisms differ in the power awarded to the proposer. The Shapley, consensus and equal surplus values are implemented in subgame perfect equilibrium outcomes as power shifts away...
متن کاملA multi agent method for cell formation with uncertain situation, based on information theory
This paper assumes the cell formation problem as a distributed decision network. It proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. Based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...
متن کاملBELIEF-FREE RATIONALIZABILITY AND INFORMATIONAL ROBUSTNESS By
We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight only on profiles of types of other players and states that that type thinks possible, combined with a...
متن کاملImproving Fourth Graders’ Literary and Informational Comprehension Skills through Cooperation while Teaching and Learning
Considering the vast amount of information on fourth graders’ poor skills in reading comprehension, especially when reading literary and informational texts, and the general agreement on the teaching methods being the main culprit, it was decided to examine the use of the cooperative method of teaching reading as a possible solution for the said problem. A random sample of 100 fourth graders fr...
متن کاملCognitive Architecture, Concepts, and Introspection: An Information-Theoretic Solution to the Problem of Phenomenal Consciousness
This essay is a sustained attempt to bring new light to some of the perennial problems in philosophy of mind surrounding phenomenal consciousness and introspection through developing an account of sensory and phenomenal concepts. Building on the information-theoretic framework of Dretske (1981), we present an informational psychosemantics as it applies to what we call sensory concepts, concepts...
متن کامل